Kirillov's Unimodality Conjecture for the Rectangular Narayana Polynomials
نویسندگان
چکیده
In the study of Kostka numbers and Catalan numbers, Kirillov posed a unimodality conjecture for the rectangular Narayana polynomials. We prove that the rectangular Narayana polynomials have only real zeros, and thereby confirm Kirillov’s unimodality conjecture. By using an equidistribution property between descent numbers and ascent numbers on ballot paths due to Sulanke and a bijection between lattice words and standard Young tableaux, we show that the rectangular Narayana polynomial is equal to the descent generating function on standard Young tableaux of certain rectangular shape, up to a power of the indeterminate. Then we obtain the real-rootedness of the rectangular Narayana polynomial based on a result of Brenti which implies that the descent generating function of standard Young tableaux has only real zeros.
منابع مشابه
Unimodality and the Reeection Principle
We show how lattice paths and the re ection principle can be used to give easy proofs of unimodality results. In particular, we give a \one-line" combinatorial proof of the unimodality of the binomial coe cients. Other examples include products of binomial coe cients, polynomials related to the Legendre polynomials, and a result connected to a conjecture of Simion.
متن کاملUnimodality and the Reflection Principle
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a “one-line” combinatorial proof of the unimodality of the binomial coefficients. Other examples include products of binomial coefficients, polynomials related to the Legendre polynomials, and a result connected to a conjecture of Simion.
متن کاملRIMS - 1824 Rigged Configurations and Catalan , Stretched Parabolic Kostka
We will look at the Catalan numbers from the Rigged Configurations point of view originated [9] from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our strategy is to take a combinatorial interpretation of Catalan numbers Cn as the number of standard Young tableaux of rectangular shape (n2), or equivalently, as the Kostka ...
متن کاملA Simple Proof of a Conjecture of Simion
Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we present a simple proof of Hildebrand’s result.
متن کاملS ep 2 00 8 A Simple Proof of a Conjecture of Simion ∗
Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we present a simple proof of Hildebrand’s result.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 25 شماره
صفحات -
تاریخ انتشار 2018